On an Optimal Quantiied Propositional Proof System and a Complete Language for Np \ Co-np
نویسنده
چکیده
In this paper we prove that if there exists an optimal quan-tiied propositional proof system then there exists a complete language for NP \ co-NP.
منابع مشابه
Optimal Proof Systems and Complete Languages
We investigate the connection between optimal propositional proof systems and complete languages for promise classes. We prove that an optimal propositional proof system exists if and only if there exists a propositional proof system in which every promise class with the test set in co-NP is representable. Additionally, we prove that there exists a complete language for UP if and only if there ...
متن کاملOn an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP
Proof Systems for Structured Algebraic Specifications: An Overview p. 19 Average-Case Analysis via Incompressibility p. 38 Locally Computable Enumerations p. 51 The Complexity of Error-Correcting Codes p. 67 Stochastic Analysis of Dynamic Processes p. 85 k-k Sorting on the Multi-Mesh p. 93 Refinement of Coloured Petri Nets p. 105 Stratified Petri Nets p. 117 Distributed Acyclic Orientation of A...
متن کاملQuantified Propositional Logic and the Number of Lines of Tree-Like Proofs
There is an exponential speed-up in the number of lines of the quantiied propositional sequent calculus over Substitution Frege Systems, if one considers proofs as trees. Whether this is true also for the number of symbols, is still an open problem. The existence of a propositional proof system which has polynomial size proofs for all tautologies is equivalent to say that NP = co-NP CR79]. This...
متن کاملComplete Problems for Promise Classes by Optimal Proof Systems for Test Sets
We present a uniform approach to investigate the relationship between the existence of complete sets for promise classes and the existence of (p-)optimal proof systems for certain languages. Central to our approach is the notion of a test set which can be used to verify that a given nondeterministic polynomial-time machine obeys the promise on a given input. Basically, we show that a promise cl...
متن کاملNondeterministic functions and the existence of optimal proof systems
We provide new characterizations of two previously studied questions on nondeterministic function classes: Q1: Do nondeterministic functions admit efficient deterministic refinements? Q2: Do nondeterministic function classes contain complete functions? We show that Q1 for the class NPMVt is equivalent to the question whether the standard proof system for SAT is p-optimal, and to the assumption ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997